Research on position-dependent weights scheduling with delivery times and truncated sum-of-processing-times-based learning effect
نویسندگان
چکیده
This paper considers single-machine position-dependent weights scheduling problem with past-sequence-dependent delivery times and truncated sum-of-processing-times-based learning effect. The objective is to minimize the weighted sum of due date, number early jobs tardy jobs, where are weights. Under common slack date different assignments, optimal properties given, corresponding solution algorithms respectively proposed obtain sequence dates jobs.
منابع مشابه
Single-machine scheduling problems with past-sequence-dependent delivery times and position-dependent processing times
We consider single-machine scheduling problems with past-sequence-dependent (p-s-d) job delivery times. The p-s-d delivery time is needed to remove any waiting time-induced adverse effects on the job’s condition (prior to delivering the job to the customer) and it is therefore proportional to the job’s waiting time. We show that single-machine scheduling problems with p-s-d delivery times and w...
متن کاملScheduling jobs with position-dependent processing times
Bachman and Janiak provided a sketch of the proof that the problem 1|ri,pi(v)1⁄4 ai/v|Cmax is NP-hard in the strong sense. However, they did not show how to avoid using harmonic numbers whose encoding is not pseudo-polynomial, which makes the proof incomplete. In this corrigendum, we provide a new complete proof. Journal of the Operational Research Society (2012) 63, 1018–1020. doi:10.1057/jors...
متن کاملSome scheduling problems with sum-of-processing-times-based and job-position-based learning effects
In this paper we introduce a new scheduling model with learning effects in which the actual processing time of a job is a function of the total normal processing times of the jobs already processed and of the job’s scheduled position. We show that the single-machine problems to minimize makespan and total completion time are polynomially solvable. In addition, we show that the problems to minim...
متن کاملSome single-machine scheduling with sum-of-processing-time-based and job-position-based processing times
The single-machine scheduling problems with position and sum-of-processing-time based processing times are considered. The actual processing time of a job is defined by function of its scheduled position and total normal processing time of jobs in front of it in the sequence. We provide optimal solutions in polynomial time for some special cases of the makespan minimization and the total comple...
متن کاملA Job Shop Scheduling Problem with Sequence-Dependent Setup Times Considering Position-Based Learning Effects and Availability Constraints
Sequence dependent set-up times scheduling problems (SDSTs), availability constraint and transportation times are interesting and important issues in production management, which are often addressed separately. In this paper, the SDSTs job shop scheduling problem with position-based learning effects, job-dependent transportation times and multiple preventive maintenance activities is studied. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Industrial and Management Optimization
سال: 2023
ISSN: ['1547-5816', '1553-166X']
DOI: https://doi.org/10.3934/jimo.2022066